A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem

摘要

A new asymmetric cryptosystem based on the Integer Factorization Problem isproposed. It posses an encryption and decryption speed of $O(n^2)$, thus makingit the fastest asymmetric encryption scheme available. It has a simplemathematical structure. Thus, it would have low computational requirements andwould enable communication devices with low computing power to deploy securecommunication procedures efficiently.